NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
181	PDF Document Add to Reading List Source URL: www.math.uchicago.edu Language: English - Date: 2009-04-19 00:17:55 Puzzles NP-complete problems Crossword Cluedo Cryptic crossword The New York Times crossword puzzle
182	Colloquium Department of Computer Science Dr. Darren Strash Darren graduated in 2011 with a PhD in Computer Science from University of California, Irvine, with Mike Goodrich and David Eppstein as advisors. After graduati Add to Reading List Source URL: www.cs.siu.edu Language: English - Date: 2015-11-12 17:19:02 NP-complete problems Theoretical computer science Analysis of algorithms Parameterized complexity Independent set Algorithm Kernelization Book:Graph Theory Book:Graph Algorithms
183	SIAM J. DISCRETE MATH. Vol. 23, No. 4, pp. 1800–1813 c 2009 Society for Industrial and Applied Mathematics Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2010-04-26 06:33:56 NP-complete problems Trapezoid graph Graph coloring Independent set Intersection graph Interval graph Clique Perfect graph Pathwidth Planar graph
184	Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP∗ Matthias Englert Heiko R¨oglin Add to Reading List Source URL: www.dcs.warwick.ac.uk Language: English - Date: 2008-09-04 11:36:22 NP-hard problems NP-complete problems Operations research Travelling salesman problem Gadget Graph
185	Puzzle "Two Squares" by John de Cuevas Instructions: Guess the words defined by the cryptic clues (words vary in length from four to nine letters and include five proper names), then enter them in the grid one after anot Add to Reading List Source URL: www.puzzlecrypt.com Language: English - Date: 2013-05-26 17:52:01 NP-complete problems Crossword Puzzles Cryptic crossword
186	Finding vertex-surjective graph homomorphisms⇤ Petr A. Golovach†, Bernard Lidick´ y‡, † Barnaby Martin, and Dani¨el Paulusma† Add to Reading List Source URL: orion.math.iastate.edu Language: English - Date: 2014-08-22 14:45:03 Morphisms Graph theory NP-complete problems Graph coloring Graph operations Pathwidth Graph homomorphism Treewidth Cograph Graph isomorphism Indifference graph Clique-width
187	Exercise 12: Weed Weak models Task 1: Hyper, hyper! Recall that a hypergraph is a graph where edges may comprise more than 2 nodes. The degree of a hyperedge is the number of nodes in it. Consider a hypergraph of maximum Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2015-01-20 10:45:26 Graph coloring Hypergraphs NP-complete problems Vertex cover Edge coloring Matching Constraint programming ErdsFaberLovsz conjecture Constraint graph
188	Moment methods in energy minimization David de Laat CWI Amsterdam Andrejewski-Tage Moment problems in theoretical physics Add to Reading List Source URL: www.daviddelaat.nl Language: English Operations research Discrete geometry NP-complete problems Conjectures Circle packing Sphere packing Independent set Kepler conjecture Tammes problem Mathematical optimization Semidefinite programming FranklRdl graph
189	Combinatorial Optimization and Recognition of Graph Classes with Applications to Related Models Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2009-12-21 16:02:55 NP-complete problems Trapezoid graph Interval graph Perfect graph Indifference graph Independent set Permutation graph Clique problem Hamiltonian path problem Longest path problem Pathwidth Intersection graph
190	Excluding Graphs as Immersions in Surface Embedded Graphs Archontia C. Giannopoulou1,?,?? , Marcin Kami´nski2 , and Dimitrios M. Thilikos3? ? ? 1 2 Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2013-04-23 04:28:57 Graph theory NP-complete problems Graph connectivity Graph minor Graph operations Graph coloring Graph K-edge-connected graph Degree Tree Planar graph Line graph

UPDATE